A catalog of matchstick graphs
نویسنده
چکیده
Classification of planar unit-distance graphs with up to 9 edges, by homeomorphism and isomorphism classes. With exactly nine edges, there are 633 nonisomorphic connected matchstick graphs, of which 19 are topologically distinct from each other. Increasing edges' number, their quantities rise more than exponentially, in a still unclear way.
منابع مشابه
Regular Matchstick Graphs
A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.
متن کاملWho Needs Crossings? Hardness of Plane Graph Rigidity
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: “globally noncrossing” graphs, which avoid crossings in all of their configurations; matchstick graphs, with unit-length edges and where only noncrossing configurations are considered; and unrestricted graphs (crossings allowed) with unit edge lengths (or in the ...
متن کاملComparison of catalog of (3, g) Hamiltonian bipartite graphs with other known lists
The focus of this paper is on discussion of a catalog of a class of (3, g) graphs for even girth g. A (k, g) graph is a graph with regular degree k and girth g. This catalog is compared with other known lists of (3, g) graphs such as the enumerations of trivalent symmetric graphs and enumerations of trivalent vertex-transitive graphs, to conclude that this catalog has graphs for more orders tha...
متن کاملAbout the catalog of (3, g) Hamiltonian bipartite graphs
A catalog of a class of (3, g) graphs for even girth g is introduced in this paper. A (k, g) graph is a graph with regular degree k and girth g. This catalog of (3, g) graphs for even girth g satisfying 6 ≤ g ≤ 16, has the following properties. Firstly, this catalog contains the smallest known (3, g) graphs. An appropriate class of trivalent graphs for this catalog has been identified, such tha...
متن کاملMetrically Homogeneous Graphs Ii (notes)
We continue the analysis of metrically homogeneous graphs, taking up where the catalog left off. We give some general results on the structure of Γi, and show that the metrically homogeneous graphs of diameter 3 are all in the catalog.
متن کامل